|
In computability and complexity theory, ALL is the class of all decision problems. ==Relations to other classes== ALL contains all complexity classes of decision problems, including RE and co-RE. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「ALL (complexity)」の詳細全文を読む スポンサード リンク
|